S OME R ESEARCH T OPICS FOR S TUDENTS Quentin F. Stout Here’s a quick overview of some research topics I’m interested in. I’ve also worked with many students that initiated their own project. If yo

Source URL: web.eecs.umich.edu

• Parallel computing
• Spanning tree
• Analysis of algorithms
• Search algorithms
• Parallel algorithm
• Algorithm
• Genetic algorithm
• Parallel Random Access Machine
• Minimum spanning tree
• Theoretical computer science
• Concurrent computing
• Applied mathematics

An Optimal Minimum Spanning Tree Algorithm SETH PETTIE AND VIJAYA RAMACHANDRAN The University of Texas at Austin, Austin, Texas Abstract. We establish that the algorithmic complexity of the minimum spanning tree problem

Source URL: web.eecs.umich.edu

CME 305: Discrete Mathematics and Algorithms Instructor: Professor Amin Saberi () Midterm – Problem 1. Show that a graph has a unique minimum spanning tree if, for every cut of the graph, th

Source URL: stanford.edu

CME 305: Discrete Mathematics and Algorithms Instructor: Professor Amin Saberi () Midterm – Problem 1. Show that a graph has a unique minimum spanning tree if, for every cut of the graph, th

Source URL: stanford.edu

ENGINEERING AN EXTERNAL MEMORY MINIMUM SPANNING TREE ALGORITHM Roman Dementiev, Peter Sanders, Dominik Schultes Max-Planck-Institut f. Informatik, 66123 Saarbrücken, Germany {dementiev,sanders}@mpi-sb.mpg.de,mail@domi

Source URL: algo2.iti.kit.edu

An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ ‡ Michel X. Goemans†

Source URL: www.stanford.edu

• Spanning tree
• Loop-erased random walk
• Minimum spanning tree
• Chernoff bound
• Eulerian path
• NP-complete problems
• Dominating set
• Tutte polynomial
• Graph theory
• Mathematics
• Theoretical computer science

Tree-based Coarsening and Partitioning of Complex Networks Roland Glantz, Henning Meyerhenke, and Christian Schulz arXiv:1402.2782v2 [cs.DS] 13 Feb 2014

Source URL: arxiv.org

• Graph connectivity
• Combinatorial optimization
• Spanning tree
• NP-complete problems
• Graph partition
• Vertex
• Minimum spanning tree
• Edge contraction
• Tree
• Graph theory
• Mathematics
• Theoretical computer science

CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic

Source URL: stanford.edu

• NP-complete problems
• Clique problem
• Vertex cover
• Matching
• Eulerian path
• Clique
• Minimum spanning tree
• Randomized algorithm
• Connectivity
• Graph theory
• Theoretical computer science
• Mathematics

6.889 — Lecture 15: Traveling Salesman (TSP) Christian Sommer (figures by Philip Klein) November 2, 2011 Traveling Salesman Problem (TSP) given G = (V, E) find a tour visiting each1 node v ∈ V . NP–har

Source URL: courses.csail.mit.edu

• Spanning tree
• NP-complete problems
• Operations research
• Travelling salesman problem
• Graph operations
• Minimum spanning tree
• Graph
• Planar graph
• Eulerian path
• Graph theory
• Theoretical computer science
• Mathematics

CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () Midterm Review SessionNote that these solutions are compact and only provide the key ideas in answer of the question. The

Source URL: stanford.edu

• Network flow
• Hamiltonian path
• Maximum flow problem
• Ford–Fulkerson algorithm
• Flow network
• Tree decomposition
• Minimum spanning tree
• Graph theory
• Mathematics
• Theoretical computer science